jsCoq: Towards Hybrid Theorem Proving Interfaces
نویسندگان
چکیده
We describe jsCoq, a new platform and user environment for the Coq interactive proof assistant. The jsCoq system targets the HTML5–ECMAScript 2015 specification, and it is typically run inside a standards-compliant browser, without the need of external servers or services. Targeting educational use, jsCoq allows the user to start interaction with proof scripts right away, thanks to its self-contained nature. Indeed, a full Coq environment is packed along the proof scripts, easing distribution and installation. Starting to use jsCoq is as easy as clicking on a link. The current release ships more than 10 popular Coq libraries, and supports popular books such as Software Foundations or Certified Programming with Dependent Types. The new target platform has opened up new interaction and display possibilities. It has also fostered the development of some new Coq-related technology. In particular, we have implemented a new serialization-based protocol for interaction with the proof assistant, as well as a new package format for library distribution.
منابع مشابه
Towards a Provably Correct μ – Kernel
In this note we suggest to combine the recent developments in two different areas of computer science. First, μ–kernels of the second generation make it possible to structure operating systems into several parts with smaller interfaces. These interfaces can be enforced through the separation of address spaces. Second, powerful tools for theorem proving and new approaches to software verificatio...
متن کاملCombining Theorem Proving with Static Analysis for Data Structure Consistency
We describe an approach for combining theorem proving techniques with static analysis to analyze data structure consistency for programs that manipulate heterogeneous data structures. Our system uses interactive theorem proving and shape analysis to verify that data structure implementations conform to set interfaces. A simpler static analysis then uses the verified set interfaces to verify pro...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملEvaluating the Interfaces of Three Theorem Proving Assistants
A rst step in systematically engineering better interfaces for theorem proving assistants (TPAs) is to assess what has already been achieved in the domain. We examine three TPAs employing quite different styles of interaction. We consider the support provided by the interfaces for each of four mechanisms for eecient interactive proof: planning, reuse, reeection and articulation. Common themes a...
متن کاملExperiments in Theorem Proving for Topological Hybrid Logic
This paper discusses two experiments in theorem proving for hybrid logic under the topological interpretation. We begin by discussing the topological interpretation of hybrid logic and noting what it adds to the topological interpretation of orthodox modal logic. We then examine two implemented proof methods. The first makes use of HyLoBan, a terminating theorem prover that searches for a winni...
متن کامل